Complexity Quantification for Overhead Transmission Line Emergency Repair Scheme via a Graph Entropy Method Improved with Petri Net and AHP Weighting Method
نویسندگان
چکیده
منابع مشابه
A Petri Net Synthesis Method
We motivate and study the synthesis of Petri nets. Petri net synthesis can avoid the state exploration problem by guaranteeing the correctness in the Petri net while incrementally expanding the net. For systems specified in Petri nets, this paper proposes a synthesis method. One major advantage of this synthesis technique is that the resultant ordinary Petri net is guaranteed to be structural l...
متن کاملA Novel Method for Petri Net Modeling
Message Sequence Chart (MSC) is a graphical trace language for describing the communication behaviour of distributed systems. In order to build a Petri Net model of a complex system, this paper introduces a strategy to build a Petri Net model by using MSC. The algorithm of translating the MSC model to Petri Net model is also given in this paper. We can get the Petri Net model and improve it by ...
متن کاملDesigning coloured Petri net models: a method
When designing a complex system with critical requirements (e.g. for safety issues), formal models are often used for analysis prior to costly hardware/software implementation. However, writing the formal specification starting from the textual description is not easy. An approach to this problem has been developed in the context of algebraic specifications [5]. Here, we present a similar metho...
متن کاملEntropy method for line-energies
In this paper we analyze energy functionals concentrated on the discontinuity lines of unitlength, divergence-free 2D vector fields. The motivation comes from thin-film micromagnetics where these functionals correspond to mesoscopic wall-energies. A natural issue consists in characterizing the line-energy densities for which the functionals are lower semicontinuous for a relevant topology. In f...
متن کاملCorrections to generalized Petri net reduction method
Let PN be the number of logical operations needed for constructing all lconv tables for an N bit image. We denote such a lconv table as LCTABLE( N ) . PN can be calculated on the basis of PNcorresponding to LCTABLE( N 1). The first row in the LCTABLE( N ) requires N more logical operations than Phijust for a given first bit of the N-bit threshold value. There are two cases (either “0” or “1”) f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2014
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2014/761507